On the maximum empty rectangle problem
نویسندگان
چکیده
Given a rectangle A and a set S of n points in A, we consider the problem, called the maximum empty rectangle problem, of finding a maximum area rectangle that is fully contained in A and does not contain any point of S in its interior. An O(n’) time algorithm is presented. Furthermore, it is shown that if the points of S are drawn randomly and independently from A, the problem can be solved in O(n(log n)*) expected time.
منابع مشابه
A note on finding a maximum empty rectangle
Given a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A. has its sides parallel to Ihose ofA. and does Dot contain any of the points in S. This Dote describes an efficient algorithm for solving this problem.
متن کاملInplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle
There is a high demand of space-efficient algorithms in builtin or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region R in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of n points in R using O(logn) ...
متن کاملOn the Number of Maximum Empty Boxes Amidst n Points
We revisit the following problem (along with its higher dimensional variant): Given a set S of n points inside an axis-parallel rectangle U in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in U but contains no points of S. 1. We prove that the number of maximum-area empty rectangles amidst n points in the plane is O(n logn 2α(n)), where α(n) is the extremely slowl...
متن کاملOn the number of maximum empty boxes
We revisit the following problem (along with its higher dimensional variant): Given a set S of n points inside an axis-parallel rectangle U in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in U but contains no points of S. (I) We prove that the number of maximum-area empty rectangles amidst n points in the plane is O(n log n 2), where α(n) is the extremely slowly ...
متن کاملThe Bichromatic Square and Rectangle Problems
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains as many blue points as possible without containing any red points. Let n be the total number of red and blue points. We solve the bichromatic square problem in O(n log n) time and O(n) space. We also solve the bichromatic rectangle problem in O(n log n) time and O(n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 8 شماره
صفحات -
تاریخ انتشار 1984